An elementary proof of the canonizing version of Gallai-Witt's theorem
نویسندگان
چکیده
A homothetic mapping (homothety) of the r-dimensional lattice grid N’ is a mapping h: N’ + N’ of the form h(b) = a + db, where a E Nf is a translation vector and d is a positive integer describing a dilatation. A multidimensional version of van der Waerden’s theorem on arithmetic progressions is independently due to Gallai and to Witt (for general references see [S]). It asserts that for every mapping d: IO,..., n l}’ + (0, l}, where n 2 n(t, m) is sufficiently large, there exists a homothety h: N’ + N’ such that d(h(b)) = d(h(c)) for all b, c e (O,..., m l}‘. A canonizing version of this theorem was proved by Deuber, Graham, Promel, and Voigt [ 11. Let Us Cl’ be a linear subspace of the t-dimensional vector space over the rationals. Let d “: N’ + N be a mapping with the property that A,(b) = A,(c) iff b c E U. Of course, A U acts constantly on each coset of U and different cosets get different images. Obviously, A,(h(b)) = A.(h(c)) iff A.(b) = A.(c) for every homothety. Thus, A, induces the same pattern on all homothetic copies of {CL, WI1)‘. A vector b E Q’ is called admissible for SE N’ iff there exists a E Q’ such that the affine line {a + Ib 1 A E Q } intersects S in at least two points. Let
منابع مشابه
Sylvester-Gallai Theorems for Complex Numbers and Quaternions
A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be collinear. A problem of Serre (1966) asks whether an SG configuration in a complex projective space must be coplanar. This was proved by Kelly (1986) using a d...
متن کاملSylvester-Gallai Theorem and Metric Betweenness
Sylvester conjectured in 1893 and Gallai proved some forty years later that every finite set S of points in the plane includes two points such that the line passing through them includes either no other point of S or all other points of S. There are several ways of extending the notion of lines from Euclidean spaces to arbitrary metric spaces. We present one of them and conjecture that, with li...
متن کاملThe Sylvester-Gallai theorem, colourings and algebra
Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours. Suppose that for any two distinct points A, B ∈ S sharing a colour there is a third point C ∈ S, of the other colour, collinear with A and B. Then all the point...
متن کاملCommon xed point theorem for w-distance with new integral type contraction
Boujari [5] proved a fixed point theorem with an old version of the integraltype contraction , his proof is incorrect. In this paper, a new generalizationof integral type contraction is introduced. Moreover, a fixed point theorem isobtained.
متن کاملElementary Versions of the Sylvester-Gallai Theorem
A Sylvester-Gallai (SG) configuration is a set S of n points such that the line through any two points of S contains a third point in S. L. M. Kelly (1986) positively settled an open question of Serre (1966) asking whether an SG configuration in a complex projective space must be planar. N. Elkies, L. M. Pretorius, and K. J. Swanepoel (2006) have recently reproved this result using elementary m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 42 شماره
صفحات -
تاریخ انتشار 1986